Exact Dynamic Support Tracking with Multiple Measurement Vectors using Compressive MUSIC
نویسندگان
چکیده
Dynamic tracking of sparse targets has been one of the important topics in array signal processing. Recently, compressed sensing (CS) approaches have been extensively investigated as a new tool for this problem using partial support information obtained by exploiting temporal redundancy. However, most of these approaches are formulated under single measurement vector compressed sensing (SMV-CS) framework, where the performance guarantees are only in a probabilistic manner. The main contribution of this paper is to allow deterministic tracking of time varying supports with multiple measurement vectors (MMV) by exploiting multi-sensor diversity. In particular, we show that a novel compressive MUSIC (CS-MUSIC) algorithm with optimized partial support selection not only allows removal of inaccurate portion of previous support estimation but also enables addition of newly emerged part of unknown support. Numerical results confirm the theory.
منابع مشابه
Compressive MUSIC: A Missing Link Between Compressive Sensing and Array Signal Processing
The multiple measurement vector (MMV) problem addresses the identification of unknown input vectors that share common sparse support. Even though MMV problems have been traditionally addressed within the context of sensor array signal processing, the recent trend is to apply compressive sensing (CS) due to its capability to estimate sparse support even with an insufficient number of snapshots, ...
متن کاملCooperative Control of Multiple Quadrotors for Transporting a Common Payload
This paper investigates the problem of controlling a team of Quadrotors that cooperatively transport a common payload. The main contribution of this study is to propose a cooperative control algorithm based on a decentralized algorithm. This strategy is comprised of two main steps: the first one is calculating the basic control vectors for each Quadrotor using Moore–Penrose theory aiming at coo...
متن کاملNoise Robust Joint Sparse Recovery using Compressive Subspace Fitting
We study a multiple measurement vector (MMV) problem where multiple signals share a common sparse support set and are sampled by a common sensing matrix. Although we can expect that joint sparsity can improve the recovery performance over a single measurement vector (SMV) problem, compressive sensing (CS) algorithms for MMV exhibit performance saturation as the number of multiple signals increa...
متن کاملA Fast Noniterative Algorithm for Compressive Sensing Using Binary Measurement Matrices
In this paper we present a new algorithm for compressive sensing that makes use of binary measurement matrices and achieves exact recovery of sparse vectors, in a single pass, without any iterations. Our algorithm is hundreds of times faster than l1-norm minimization, and methods based on expander graphs (which require multiple iterations). Moreover, our method requires the fewest measurements ...
متن کاملA Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks
Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1110.0378 شماره
صفحات -
تاریخ انتشار 2011